Search results

A group of n (> 1) peers are required to cooperate with each other in distributed applications on P2P overlay networks. A P2P group is distributed without a centralized controller and is scalable and heterogeneous. The purpose of this paper is to discuss how to realize a scalable group in P2P overlay networks.

In a group, messages have to be causally delivered to every peer. In order to realize a scalable group, messages are ordered by taking advantage of linear time (LT) and physical time (PT) since message length is O(1). Here, each peer has to hold information on the accuracy of physical clock of each peer and minimum delay time among every pair of peers. Since the size of the information is O(n²), it is difficult for each peer to hold the information and so the authors discuss a multi‐layered model to reduce the size of group information.

Through the evaluation studies, it is shown how the size of the group information can be reduced in a multi‐layered group compared with a traditional flat group.

In this paper, the authors discuss a multi‐layered group model for a scalable group, to reduce the size of group information; and also order messages by using both the linear time and physical time.